/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package test;

import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;

/**
 *
 * @author Spyros
 */
public class NewMain {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        int numOfConcetrators = 3;
        int numOfTerminals = 20;

        int[] bits = new int[numOfConcetrators * numOfTerminals];
        for (int i = 0; i < bits.length; i++) {
            bits[i] = 1;
        }
        String binary = Arrays.toString(bits).replace("[", "").replace("]", "").replace(", ", "");
//        Integer max = Integer.parseInt(binary, 2);
        BigInteger max = new BigInteger(binary, 2);
        //find max numofterminals bits

        int[] bitsT = new int[numOfTerminals];
        for (int i = 0; i < bitsT.length; i++) {
            bitsT[i] = 1;
        }
        String binaryT = Arrays.toString(bitsT).replace("[", "").replace("]", "").replace(", ", "");
//        Integer max = Integer.parseInt(binary, 2);
        BigInteger maxT = new BigInteger(binaryT, 2);

        BigInteger maxSteps = max.divide(maxT);
        //iterate
        System.out.println("possible solutions: " + max);
        BigInteger i = BigInteger.valueOf(0);
        BigInteger count = BigInteger.valueOf(1);

    }
}
